A comparison of word graph and n-best list based confidence measures
نویسندگان
چکیده
In this paper we present and compare several confidence measures for large vocabulary continuous speech recognition. We show that posterior word probabilities computed on word graphs and N-best lists clearly outperform non-probabilistic confidence measures, e.g. the acoustic stability and the hypothesis density. In addition, we prove that the estimation of posterior word probabilities on word graphs yields better results than their estimation on N-best lists and discuss both methods in detail. We present experimental results on three different corpora, the English NAB ’94 20k development corpus, the German VERBMOBIL ’96 evaluation corpus and a Dutch corpus, which has been recorded with a train timetable information system in the ARISE project.
منابع مشابه
Local word confidence measure using word graph and n-best list
This paper presents some confidence measures for large vocabulary speech recognition which are based on word graph or N-Best List structures. More and more applications need fast estimation of any measures in order to stay real-time. We propose some simple and fast measures, locally computed, that can be directly used within the first decoding recognition process. We also define some other meas...
متن کاملConfidence Measures for Statistical Machine Translation
In this paper, we present several confidence measures for (statistical) machine translation. We introduce word posterior probabilities for words in the target sentence that can be determined either on a word graph or on an N best list. Two alternative confidence measures that can be calculated on N best lists are proposed. The performance of the measures is evaluated on two different translatio...
متن کاملImpact of word graph density on the quality of posterior probability based confidence measures
Our new experimental results, presented in this paper, clearly prove the dependence between word graph density and the quality of two different confidence measures. Both confidence measures are based on the computation of the posterior probabilities of the hypothesized words and apply the time alignment information of the word graph for confidence score accumulation. We show that the quality of...
متن کاملA word graph based n-best search in continuous speech recognition
In this paper, we introduce an e cient algorithm for the exhaustive search of N best sentence hypotheses in a word graph. The search procedure is based on a two-pass algorithm. In the rst pass, a word graph is constructed with standard time-synchronous beam search. The actual extraction of N best word sequences from the word graph takes place during the second pass. With our implementation of a...
متن کاملImproving posterior based confidence measures in hybrid HMM/ANN speech recognition systems
In this paper, building upon previous work by others [7], we define and investigate a set of confidence measures based on hybrid Hidden Markov Model/Artificial Neural Network (HMM/ANN) acoustic models. All these measures are using the neural network to estimate the local phone posterior probabilities, which are then combined and normalized in different ways. Experimental results will indeed sho...
متن کامل